全文获取类型
收费全文 | 196篇 |
免费 | 53篇 |
国内免费 | 2篇 |
专业分类
251篇 |
出版年
2024年 | 5篇 |
2023年 | 1篇 |
2022年 | 4篇 |
2021年 | 5篇 |
2020年 | 1篇 |
2019年 | 2篇 |
2018年 | 4篇 |
2017年 | 8篇 |
2016年 | 18篇 |
2015年 | 11篇 |
2014年 | 20篇 |
2013年 | 18篇 |
2012年 | 18篇 |
2011年 | 20篇 |
2010年 | 10篇 |
2009年 | 9篇 |
2008年 | 9篇 |
2007年 | 12篇 |
2006年 | 11篇 |
2005年 | 12篇 |
2004年 | 6篇 |
2003年 | 2篇 |
2002年 | 3篇 |
2001年 | 1篇 |
2000年 | 7篇 |
1999年 | 4篇 |
1998年 | 10篇 |
1997年 | 6篇 |
1996年 | 5篇 |
1995年 | 3篇 |
1992年 | 2篇 |
1991年 | 2篇 |
1990年 | 2篇 |
排序方式: 共有251条查询结果,搜索用时 15 毫秒
21.
以具有层次结构的局域网作为拓扑模型,考虑共因失效和关联失效这2类节点非独立失效事件发生的情况,建立了交换机节点失效模型来模拟交换机失效,利用Monte-Carlo仿真算法近似计算出网络的两端可靠性,研究2种共因失效事件和3种关联失效事件对网络端端可靠性的影响。结果表明:因资源节点出现故障和协议层出现错误而导致交换机失效的共因失效事件均会降低网络可靠性,且资源节点失效概率或协议层失效概率越大,网络可靠性越低;而由于使用了热备份技术、堆叠技术以及发生广播风暴导致的关联失效事件,即使节点独立失效概率很小,只要相关因数足够大,故障都会快速传播,导致网络可靠性迅速下降。 相似文献
22.
Fernando M. M. Ruiz Florent Hainaut Nathalie Schiffino 《Defence and Peace Economics》2016,27(6):774-793
Lobbyists may not share the same interests, but they usually agree to form a link in a network which could eventually be used to spread information, to search for potential partners, to speak with one voice to decision makers. In other words, social links represent value for lobbyists because they may ultimately facilitate access. In this article, we explore the network of the Security and Defense lobbies in the EU and we describe its structure. 相似文献
23.
Sunkyo Kim 《海军后勤学研究》2005,52(5):399-408
In this paper, we present the heavy‐traffic bottleneck phenomenon under multiclass deterministic routing and discuss how it can be addressed by decomposition approximation. Examples show that Bitran and Tirupati's method and Whitt's enhancements for deterministic routing may not properly account for this phenomenon. We propose refinements to these methods based on Whitt's variability functions. Results of numerical experiments on simple networks and semiconductor manufacturing process show significant improvement in the approximation of expected waiting time at bottleneck stations. © 2005 Wiley Periodicals, Inc. Naval Research Logistics, 2005. 相似文献
24.
Extending Sastry's result on the uncapacitated two‐commodity network design problem, we completely characterize the optimal solution of the uncapacitated K‐commodity network design problem with zero flow costs for the case when K = 3. By solving a set of shortest‐path problems on related graphs, we show that the optimal solutions can be found in O(n3) time when K = 3, where n is the number of nodes in the network. The algorithm depends on identifying a list of “basic patterns”; the number of basic patterns grows exponentially with K. We also show that the uncapacitated K‐commodity network design problem can be solved in O(n3) time for general K if K is fixed; otherwise, the time for solving the problem is exponential. © 2004 Wiley Periodicals, Inc. Naval Research Logistics, 2004 相似文献
25.
26.
27.
In this article, the Building Evacuation Problem with Shared Information (BEPSI) is formulated as a mixed integer linear program, where the objective is to determine the set of routes along which to send evacuees (supply) from multiple locations throughout a building (sources) to the exits (sinks) such that the total time until all evacuees reach the exits is minimized. The formulation explicitly incorporates the constraints of shared information in providing online instructions to evacuees, ensuring that evacuees departing from an intermediate or source location at a mutual point in time receive common instructions. Arc travel time and capacity, as well as supply at the nodes, are permitted to vary with time and capacity is assumed to be recaptured over time. The BEPSI is shown to be NP‐hard. An exact technique based on Benders decomposition is proposed for its solution. Computational results from numerical experiments on a real‐world network representing a four‐story building are given. Results of experiments employing Benders cuts generated in solving a given problem instance as initial cuts in addressing an updated problem instance are also provided. © 2008 Wiley Periodicals, Inc. Naval Research Logistics, 2008 相似文献
28.
针对水面舰艇对海作战网络的特点,基于复杂网络\"反社区\"性质,将对海作战网络描述成\"反社区\"有向赋权图。结合传统可靠性分析方法,提出了一种新的可靠性评价指标,进一步扩展了传统可靠性指标的4个特性,并通过实例仿真,证明了该指标的有效性。该方法将传统可靠性理论与复杂网络理论有效地结合起来,将进一步扩大复杂网络的适用范围。 相似文献
29.
30.
研究和设计了一种高度结构化的神经网络模型HSNN,它能方便地对结构化知识进行表示和处理。文中给出了HSNN的设计过程,并讨论了HSNN在继承、非单调推理和信息检索等方面的应用 相似文献